On relations between counting communication complexity classes
نویسندگان
چکیده
منابع مشابه
On relations between counting communication complexity classes
We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of complexity classes initiated by Babai, Frankl, and Simon [Proc. 27th IEEE FOCS 1986, pp. 337{347] and ...
متن کامل3 Relations Between Randomized Complexity Classes and Other Complexity Classes
Proof Fix a satisfying assignment a. Define the distance of r to a, denoted dist(r, a), as the number of coordinates where ri 6= ai (this is called Hamming distance). Let r = r, r, r, · · · be the assignments generated by the algorithm, and let di = dist(r , a). Note that as we only change one bit of the assignment, di+1 = di + ∆i where ∆i ∈ {−1, 1}. We claim that Pr[∆i = −1] ≥ 1/2. Once this i...
متن کاملCounting Complexity Classes
Shripad Thite May 11, 1998 Abstra t The ounting omplexity lasses are de ned in terms of the number of a epting omputation paths of nondetereministi polynomial-time Turing ma hines. They are, therefore, the ounting versions of de ision problems in NP. We review the properties of well-known ounting lasses like #P, P, GapP, SPP et . We also give an overview of the proof of Toda's theorem that rela...
متن کاملResults on Communication Complexity Classes
Deterministic, probabilistic, nondeterministic, and alternating complexity classes defined by polylogarithmic communication are considered. Main results are (1) extending work of Ja’Ja’, Prasanna Kumar, and Simon, we give a simple technique allowing translation of most known separation and containment results for complexity classes of the fixed partition model to the more difficult optimal part...
متن کاملSome Relations between Classes of Low Computational Complexity
Evidently F is 1-bounded (respectively 2-bounded) if F(x1,..., xm) is bounded for all x1, . . . ,xm by a linear (respectively a polynomial) function of Max{xl 5. . . , xm}. We shall prove that if a 0-bounded function can be defined using 2-bounded primitive recursion it can also be defined using simultaneous 0-bounded recursions. By a class %> of number-theoretic functions we shall always mean ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2004
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.03.002